منابع مشابه
Combinatorial optimization with 2-joins
A 2-join is an edge cutset that naturally appears in decomposition of several classes of graphs closed under taking induced subgraphs, such as perfect graphs and claw-free graphs. In this paper we construct combinatorial polynomial time algorithms for finding a maximum weighted clique, a maximum weighted stable set and an optimal coloring for a class of perfect graphs decomposable by 2-joins: t...
متن کامل2 Improving Table Compression with Combinatorial Optimization ∗
We study the problem of compressing massive tables within the partition-training paradigm introduced by Buchsbaum et al. [SODA’00], in which a table is partitioned by an off-line training procedure into disjoint intervals of columns, each of which is compressed separately by a standard, on-line compressor like gzip. We provide a new theory that unifies previous experimental observations on part...
متن کاملConsidering Stochastic and Combinatorial Optimization
Here, issues connected with characteristic stochastic practices are considered. In the first part, the plausibility of covering the arrangements of an improvement issue on subjective subgraphs is studied. The impulse for this strategy is a state where an advancement issue must be settled as often as possible for discretionary illustrations. Then, a preprocessing stage is considered that would q...
متن کاملCost evaluation in joins’ optimization
This article presents an approach of the cost model used in join optimization. The search space is determined through transformations on the query blocks, depending on the selection predicate. Different implementations of the JOIN operator are taken into account for cost evaluation of the execution plans. Subject Classification: 168P15.
متن کاملStochastic Combinatorial Optimization with Risk
We consider general combinatorial optimization problems that can be formulated as minimizing the weight of a feasible solution wTx over an arbitrary feasible set. For these problems we describe a broad class of corresponding stochastic problems where the weight vector W has independent random components, unknown at the time of solution. A natural and important objective which incorporates risk ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2012
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2011.06.002